3M Algorithm: Finding an Optimal Fuzzy Cluster Scheme for Proximity Data

نویسندگان

  • Ying Xie
  • Xiaoquan Zhao
چکیده

In order to find an optimal fuzzy cluster scheme for proximity data, where just pairwise distances among objects are given, two conditions are necessary: A good cluster validity function, which can be applied to proximity data for evaluation of the goodness of cluster schemes for varying number of clusters; a good cluster algorithm that can deal with proximity data and produce an optimal solution for a fixed number of clusters. To satisfy the first condition, a new validity function is proposed, which works well even when the number of clusters is very large. For the second condition, we give a new algorithm called multi-step maxmin and merging algorithm (3M algorithm). Experiments show that, when used in conjunction with the new cluster validity function, the 3M algorithm produces satisfactory results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determining Fuzzy Sets for Quantitative Attributes in Data Mining Problems

The problem of mining association rules for fuzzy quantitative items was introduced and an algorithm proposed in [5]. However, the algorithm assumes that fuzzy sets are given. In this paper we propose a method to find the fuzzy sets for each quantitative attribute in a database by using clustering techniques. We present a scheme for finding the optimal partitioning of a data set during the clus...

متن کامل

Finding the Optimal Path to Restoration Loads of Power Distribution Network by Hybrid GA-BCO Algorithms Under Fault and Fuzzy Objective Functions with Load Variations

In this paper proposes a fuzzy multi-objective hybrid Genetic and Bee colony optimization algorithm(GA-BCO) to find the optimal restoration of loads of power distribution network under fault.Restoration of distribution systems is a complex combinatorial optimization problem that should beefficiently restored in reasonable time. To improve the efficiency of restoration and facilitate theactivity...

متن کامل

A Multi-Objective Approach to Fuzzy Clustering using ITLBO Algorithm

Data clustering is one of the most important areas of research in data mining and knowledge discovery. Recent research in this area has shown that the best clustering results can be achieved using multi-objective methods. In other words, assuming more than one criterion as objective functions for clustering data can measurably increase the quality of clustering. In this study, a model with two ...

متن کامل

Proximity fuzzy clustering for web context analysis

This study extends the web classification approach through a proximity-based fuzzy clustering sensible to the influence of the page. The proximity-based fuzzy clustering works in an unsupervised manner, augmented by a certain auxiliary supervision mechanism. The supervision scheme is realized via a number of proximity “hints” (constraints) that specify an extent to which some pairs of patterns ...

متن کامل

A Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks

In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002